SEPARABLE CONVEX RESOURCE ALLOCATION PROBLEM WITH L1-DISTANCE CONSTRAINT
نویسندگان
چکیده
منابع مشابه
Bicriteria Resource Allocation Problem in Pert Networks
We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...
متن کاملThe Separable Convex Quadratic Knapsack Problem
This paper considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP is developed for solving this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The start...
متن کاملA faster algorithm for the resource allocation problem with convex cost functions
Article history: Received 26 January 2015 Received in revised form 24 June 2015 Accepted 24 June 2015 Available online 2 July 2015
متن کاملFast scaling algorithms for M-convex function minimization with application to the resource allocation problem
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply a scaling technique to a greedy algorithm for M-convex function minimization, and run as fast as the previous minimization algorithms. We ...
متن کاملLayered Distributed Constraint Optimization Problem for Resource Allocation Problem in Distributed Sensor Networks
Distributed sensor network is an important research area of multi-agent systems. We focus on a type of distributed sensor network systems that cooperatively observe multiple targets with multiple autonomous sensors that can control their own view. The problem of allocating observation resource of the distributed sensor network can be formalized as distributed constraint optimization problems. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2019
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.62.109